Some formulas for the smallest number of generators for finite direct sums of matrix algebras

نویسنده

  • R. V. Kravchenko
چکیده

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also obtain an exact formula for the smallest number of generators for a finite direct sum of 2-by-2 matrix algebras with entries in a finite field and as a consequence obtain a formula for a similar quantity for a finite direct sum of 2-by-2 integer matrix rings. We remark that a generating set the ring ⊕k i=1 Mni(Z) ni may be used as a generating set of any matrix algebra ⊕k i=1 Mni(R) ni where R is an associative ring with a two-sided 1. 2000 MSC: 16S50, 15A30, 15A33, 15A36, 15A30, 16P90

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some formulas for the smallest number of generators of finite direct sum of matrix algebras

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also obtain an exact formula for the smallest number of generators for a finite direct sum of 2-by-2 matrix algebras with entries in a finite field and as a consequenc...

متن کامل

Some formulas for the minimal number of generators of the direct sum of matrix rings

We obtain an asymptotic upper bound for the minimal number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We obtain an exact formula for the minimal number of generators for a finite direct sum of 2-by-2 matrix algebras with entries in a finite field. As a consequence, we show...

متن کامل

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

On Direct Sum of Branches in Hyper BCK-algebras

In this paper, the notion of direct sum of branches in hks is introduced and some related properties are investigated. Applying this notion to lower hyper $BCK$-semi lattice, a necessary condition for a hi to be prime is given. Some properties of hkc are studied. It is proved that if $H$ is a hkc and $[a)$ is finite for any $ain H$, then $mid Aut(H)mid=1$.

متن کامل

NILPOTENT GRAPHS OF MATRIX ALGEBRAS

Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008